PY1_OA_Neeraj edit

نویسندگان

  • Arun Bansal
  • Neeraj Mittal
  • B. S. Sidhu
  • K. K. Aggarwal
  • Prabhdeep Singh
چکیده

Background: Majority of prison inmates live in poor living conditions. Lack of meaningful activity, endemic substance abuse, recurrent violence and sexual exploitation, loss of freedom, separation from family and friends, uncertainty about the future, and the traumas of prison life all contribute to making living in prison a stressful experience. Prison inmates usually apply inappropriate coping styles, like avoidance for solving their issues. This study was conducted at Govt. Medical College Patiala (India) to determine psychiatric morbidity and coping skills among prison inmates. Methods: This was a cross sectional study on 250 male prisoners where a purposive stratified sampling method was done. Screening was done by GHQ-12 and diagnosis was made using MINI and ICD-10. 36 item coping strategies Check List-Hindi was applied to assess coping strategies among the prisoners. The observations were statistically analyzed by using software Statistica 7.0 & SPSS 20. Results: 124 prison inmates were found to have psychiatric illness using Mini International Neuropsychiatric Interview giving a net prevalence of psychiatric morbidity to be 49.6%. Prisoners with psychiatric disorder scored more on domains of coping skills, viz., denial (t=8.03; p<0.01) and internalization (t=6.00; p<0.01); lowest scores on domain of coping skills, viz., externalization (t=10.47; p<0.01) as compared with prisoners with no psychiatric disorder. Conclusion: Psychiatric services need to be developed appropriately in the prison set up considering the enormous psychiatric morbidity in the inmates. The high rate of common psychiatric disorders calls for the use of improved psychiatric screening instruments, improved assessment and treatment capacities in prisons.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)

The edit distance between two rooted ordered trees with n nodes labeled from an alphabet Σ is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit dist...

متن کامل

Map Edit Distance vs. Graph Edit Distance for Matching Images

Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...

متن کامل

A Quadratic Programming Approach to the Graph Edit Distance Problem

In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths between graphs and provide a quadratic programming formulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstr...

متن کامل

An Eecient Uniform-cost Normalized Edit Distance Algorithm

A common model for computing the similarity of two strings X and Y of lengths m, and n respectively with m n, is to transform X into Y through a sequence of edit operations which are of three types: insertion, deletion, and substitution of symbols. The model assumes a given weight function which assigns a non-negative real cost to each of these edit operations. The amortized weight for a given ...

متن کامل

Edit Distance From Graph Spectra

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that standard string edit distance techniques can be used. To do this we use graph spectral seri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017